Preparing Relational Algebra for "Just Good Enough" Hardware
نویسنده
چکیده
Device miniaturization is pointing towards tolerating imperfect hardware provided it is “good enough”. Software design theories will have to face the impact of such a trend sooner or later. A school of thought in software design is relational : it expresses specifications as relations and derives programs from specifications using relational algebra. This paper proposes that linear algebra be adopted as an evolution of relational algebra able to cope with the quantification of the impact of imperfect hardware on (otherwise) reliable software. The approach is illustrated by developing a monadic calculus for component oriented software construction with a probabilistic dimension quantifying (by linear algebra) the propagation of imperfect behaviour from lower to upper layers of software systems.
منابع مشابه
Algorithms from Relational Speciication 4.2 Preliminaries
The purpose of a speciication is to state a problem as clearly as possible. In many cases, the most direct and intuitive way to specify a problem is by writing down a logical predicate like in the phonebook example in Chapt. ??chapt:background] that describes its possible solutions. We employ the calculus of binary relations for developing eecient algorithms from logical problem speciications, ...
متن کاملRelational algebra as formalism for hardware design
This paper introduces relational algebra as an elegant formalism to describe hardware behaviour. Hardware behaviour is modelled by functions that are represented by sets of tables. Relational algebra, developed for designing large and consistent databases is capable to operate on sets of tables and hence on sets of hardware behaviour functions. It pairs the advantages of formal design, such as ...
متن کاملNormalization Theory for XML
Specifications of XML documents typically consist of typing information (e.g., a DTD), and integrity constraints. Just like relational schema specifications, not all are good – some are prone to redundancies and update anomalies. In the relational world we have a well-developed theory of data design (also known as normalization). A few definitions of XML normal forms have been proposed, but the...
متن کاملA Hybrid Predicate Calculus∗
We present the Hybrid Predicate Calculus (HPC), a hybrid logical system which incorporates a fairly conventional first-order predicate calculus, but which also include elements of modal logic and relational algebra. A special effort has been made to produce a (syntactically and semantically) well-integrated whole, rather than just a disjoint union. Our calculus, from a formal point of view, is ...
متن کاملAn Extended Algebra for Constraint
| Constraint relational databases use constraints to both model and query data. A constraint relation contains a nite set of generalized tuples. Each generalized tuple is represented by a conjunction of constraints on a given logical theory and, depending on the logical theory and the speciic conjunction of constraints, it may possibly represent an in-nite set of relational tuples. For their ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014